High order approximation to non-smooth multivariate functions

نویسندگان

  • Anat Amir
  • David Levin
چکیده

Approximations of non-smooth multivariate functions return low-order approximations in the vicinities of the singularities. Most prior works solve this problem for univariate functions. In this work we introduce a method for approximating non-smooth multivariate functions of the form f = g + r+ where g, r ∈ C(R) and the function r+ is defined by r+(y) = { r(y), r(y) ≥ 0 0, r(y) < 0 , ∀y ∈ R . Given scattered (or uniform) data points X ⊂ R, we investigate approximation by quasi-interpolation. We design a correction term, such that the corrected approximation achieves full approximation order on the entire domain. We also show that the correction term is the solution to a Moving Least Squares (MLS) problem, and as such can both be easily computed and is smooth. Last, we prove that the suggested method includes a high-order approximation to the locations of the singularities.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximation Bounds for Smooth Functions in C(IRd) by Neural and Mixture Networks

We consider the approximation of smooth multivariate functions in C(I R d) by feedforward neural networks with a single hidden layer of non-linear ridge functions. Under certain assumptions on the smoothness of the functions being approximated and on the activation functions in the neural network, we present upper bounds on the degree of approximation achieved over the domain IR d , thereby gen...

متن کامل

Multivariate approximation

The lecture addresses topics in multivariate approximation which have caught the author’s interest in the last ten years. These include: the approximation by functions with fewer variables, correct points for polynomial interpolation, the B(ernstein,-ézier, -arycentric)-form for polynomials and its use in understanding smooth piecewise polynomial (pp) functions, approximation order from spaces ...

متن کامل

Tent-transformed lattice rules for integration and approximation of multivariate non-periodic functions

We develop algorithms for multivariate integration and approximation in the weighted half-period cosine space of smooth non-periodic functions. We use specially constructed tent-transformed rank-1 lattice points as cubature nodes for integration and as sampling points for approximation. For both integration and approximation, we study the connection between the worst-case errors of our algorith...

متن کامل

Approximating Piecewise-Smooth Functions

We consider the possibility of using locally supported quasi-interpolation operators for the approximation of univariate non-smooth functions. In such a case one usually expects the rate of approximation to be lower than that of smooth functions. It is shown in this paper that prior knowledge of the type of ’singularity’ of the function can be used to regain the full approximation power of the ...

متن کامل

Planelet Transform: A New Geometrical Wavelet for Compression of Kinect-like Depth Images

With the advent of cheap indoor RGB-D sensors, proper representation of piecewise planar depth images is crucial toward an effective compression method. Although there exist geometrical wavelets for optimal representation of piecewise constant and piecewise linear images (i.e. wedgelets and platelets), an adaptation to piecewise linear fractional functions which correspond to depth variation ov...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016